我们展示了一个基于逻辑推理的新型对话管理方法的聊天栏。除了帧对话一系列响应生成任务，我们将对话作为协作推断过程，其中扬声器共享信息以实时地合成新知识。我们的Chatbot管道在三个广泛的阶段完成了这种建模。第一阶段将用户话语转换为符号谓词表示。然后，第二阶段与更大的知识库结合使用这种结构化表示来合成使用有效的图形匹配来扫描新谓词。在第三阶段和最后阶段，我们的机器人选择一个小的谓词子集并将它们转化为英语响应。这种方法为了解用户输入的潜在语义，灵活的主动措施以及与对话背景相干的响应。

Heuristic search algorithms, e.g. A*, are the commonly used tools for pathfinding on grids, i.e. graphs of regular structure that are widely employed to represent environments in robotics, video games etc. Instance-independent heuristics for grid graphs, e.g. Manhattan distance, do not take the obstacles into account and, thus, the search led by such heuristics performs poorly in the obstacle-rich environments. To this end, we suggest learning the instance-dependent heuristic proxies that are supposed to notably increase the efficiency of the search. The first heuristic proxy we suggest to learn is the correction factor, i.e. the ratio between the instance independent cost-to-go estimate and the perfect one (computed offline at the training phase). Unlike learning the absolute values of the cost-to-go heuristic function, which was known before, when learning the correction factor the knowledge of the instance-independent heuristic is utilized. The second heuristic proxy is the path probability, which indicates how likely the grid cell is lying on the shortest path. This heuristic can be utilized in the Focal Search framework as the secondary heuristic, allowing us to preserve the guarantees on the bounded sub-optimality of the solution. We learn both suggested heuristics in a supervised fashion with the state-of-the-art neural networks containing attention blocks (transformers). We conduct a thorough empirical evaluation on a comprehensive dataset of planning tasks, showing that the suggested techniques i) reduce the computational effort of the A* up to a factor of $4$x while producing the solutions, which costs exceed the costs of the optimal solutions by less than $0.3$% on average; ii) outperform the competitors, which include the conventional techniques from the heuristic search, i.e. weighted A*, as well as the state-of-the-art learnable planners.

Estimation algorithms, such as the sliding window filter, produce an estimate and uncertainty of desired states. This task becomes challenging when the problem involves unobservable states. In these situations, it is critical for the algorithm to ``know what it doesn't know'', meaning that it must maintain the unobservable states as unobservable during algorithm deployment. This letter presents general requirements for maintaining consistency in sliding window filters involving unobservable states. The value of these requirements when designing a navigation solution is experimentally shown within the context of visual-inertial SLAM making use of IMU preintegration.

We apply topological data analysis (TDA) to speech classification problems and to the introspection of a pretrained speech model, HuBERT. To this end, we introduce a number of topological and algebraic features derived from Transformer attention maps and embeddings. We show that a simple linear classifier built on top of such features outperforms a fine-tuned classification head. In particular, we achieve an improvement of about $9\%$ accuracy and $5\%$ ERR on four common datasets; on CREMA-D, the proposed feature set reaches a new state of the art performance with accuracy $80.155$. We also show that topological features are able to reveal functional roles of speech Transformer heads; e.g., we find the heads capable to distinguish between pairs of sample sources (natural/synthetic) or voices without any downstream fine-tuning. Our results demonstrate that TDA is a promising new approach for speech analysis, especially for tasks that require structural prediction.

我们考虑在以$ s $状态的地平线$ h $和$ a $ ACTIVE的偶发性，有限的，依赖于阶段的马尔可夫决策过程的环境中进行强化学习。代理商的性能是在与环境互动以$ t $插件互动后的遗憾来衡量的。我们提出了一种乐观的后验抽样算法（OPSRL），这是一种简单的后验抽样变体，仅需要许多后样品对数，$ h $，$ s $，$ a $和$ t $ a $ h $ s $ s $ a $ a $和$ t $一对。对于OPSRL，我们保证最多可容纳订单的高概率遗憾，$ \ wideTilde {\ mathcal {o}}}（\ sqrt {h^3sat}）$忽略$ \ text {poly} \ log（hsat）$项。新型的新型技术成分是线性形式的新型抗浓缩不等式，可能具有独立感兴趣。具体而言，我们将Alfers and Dinges [1984]的Beta分布的基于正常近似的下限扩展到Dirichlet分布。我们的界限匹配订单$ \ omega（\ sqrt {h^3sat}）$的下限，从而回答了Agrawal和Jia [2017b]在情节环境中提出的空旷问题。

自动临床标题生成问题被称为建议模型，将额叶X射线扫描与放射学记录中的结构化患者信息结合在一起。我们将两种语言模型结合在一起，即表演 - 泰尔和GPT-3，以生成全面和描述性的放射学记录。这些模型的建议组合产生了文本摘要，其中包含有关发现的病理，其位置以及将每个病理定位在原始X射线扫描中的每个病理的2D热图。提出的模型在两个医学数据集（Open-I，Mimic-CXR和通用MS-Coco）上进行了测试。用自然语言评估指标测量的结果证明了它们对胸部X射线图像字幕的有效适用性。

协作过滤算法的优点是不需要敏感的用户或项目信息来提供建议。但是，他们仍然遭受与公平相关的问题的困扰，例如受欢迎程度偏见。在这项工作中，我们认为，当未向研究人员提供其他用户或项目信息时，受欢迎程度偏差通常会导致其他偏见。我们在书籍中使用书籍评分的常用数据集中的建议案例中检查了我们的假设。我们使用公开可用的外部资源将其丰富了作者信息。我们发现流行的书籍主要是由美国公民在数据集中撰写的，并且与用户的配置文件相比，流行的协作过滤算法往往会过分推荐这些书籍。我们得出的结论是，学者社区应进一步研究受欢迎程度偏见的社会含义。

文本编辑模型最近已成为单语文本生成任务（例如语法误差校正，简化和样式传输）的SEQ2SEQ模型的突出替代方法。这些任务具有共同的特征 - 它们在源文本和目标文本之间表现出大量的文本重叠。文本编辑模型利用了此观察结果，并通过预测应用于源序列的编辑操作来学会生成输出。相比之下，Seq2Seq模型从头开始生成逐字输出，从而使它们在推理时间缓慢。文本编辑模型比SEQ2SEQ模型提供了多个好处，包括更快的推理速度，更高的样本效率以及对输出的更好的控制和解释性。本教程提供了有关文本编辑模型和当前最新方法的全面概述，并分析了他们的利弊。我们讨论了与生产化有关的挑战，以及如何使用这些模型来减轻幻觉和偏见，这两者都在文本生成领域遇到了紧迫的挑战。

Transfer learning increasingly becomes an important tool in handling data scarcity often encountered in machine learning. In the application of high-throughput thickness as a downstream process of the high-throughput optimization of optoelectronic thin films with autonomous workflows, data scarcity occurs especially for new materials. To achieve high-throughput thickness characterization, we propose a machine learning model called thicknessML that predicts thickness from UV-Vis spectrophotometry input and an overarching transfer learning workflow. We demonstrate the transfer learning workflow from generic source domain of generic band-gapped materials to specific target domain of perovskite materials, where the target domain data only come from limited number (18) of refractive indices from literature. The target domain can be easily extended to other material classes with a few literature data. Defining thickness prediction accuracy to be within-10% deviation, thicknessML achieves 92.2% (with a deviation of 3.6%) accuracy with transfer learning compared to 81.8% (with a deviation of 3.6%) 11.7% without (lower mean and larger standard deviation). Experimental validation on six deposited perovskite films also corroborates the efficacy of the proposed workflow by yielding a 10.5% mean absolute percentage error (MAPE).

我们提出了在表格，依赖阶段的，情节的马尔可夫决策过程中使用贝叶斯-UCBVI算法进行增强学习的：Kaufmann等人的贝叶斯-UCB算法的自然扩展。 （2012年）用于多军匪徒。我们的方法将Q值函数后部的分位数用作最佳Q值函数上的上限。对于贝叶斯-UCBVI，我们证明了一个遗憾的是$ \ wideTilde {o}（\ sqrt {h^3sat}）$，其中$ h $是一集的长度，$ s $是$ s $的数量，$ a $ a $动作数量，$ t $情节数，与$ \ omega（\ sqrt {h^3sat}）$符合poly-$ \ $ \ log $ enter $ h，s，s，a，a，a，a，a ，适用于足够大的$ t $的t $。据我们所知，这是第一种获得对地平线$ h $（和$ s $）的最佳依赖性的算法，而无需涉及伯恩斯坦的奖金或噪音。对于我们的分析而言，至关重要的是一种新的细粒抗浓缩，以具有独立感兴趣的加权dirichlet总和。然后，我们解释了如何轻松地将贝叶斯-UCBVI延伸到表格环境之外，从而在我们的算法和贝叶斯引导之间表现出牢固的联系（Rubin，1981）。